On Sperner (semi)hypergroups

on semihypergroups and hypergroups

in this thesis, first the notion of weak mutual associativity (w.m.a.) and the necessary and sufficient condition for a $(l,gamma)$-associated hypersemigroup $(h, ast)$ derived from some family of $lesssim$-preordered semigroups to be a hypergroup, are given. second, by proving the fact that the concrete categories, semihypergroups and hypergroups have not free objects we will introduce t...

On Pure Hyperradical in Semihypergroups

On Transitive Soft Sets over Semihypergroups

The aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by SH and TH , respectively. It is shown that TH = SH if and only if β = β ∗. We also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.

Games on the Sperner Triangle

We create a new two-player game on the Sperner Triangle based on Sperner’s lemma. Our game has simple rules and several desirable properties. First, the game is always certain to have a winner. Second, like many other interesting games such as Hex and Geography, we prove that deciding whether one can win our game is a PSPACE-complete problem. Third, there is an elegant balance in the game such ...

On Saturated k-Sperner Systems

Given a set X, a collection F ⊆ P(X) is said to be k-Sperner if it does not contain a chain of length k + 1 under set inclusion and it is saturated if it is maximal with respect to this property. Gerbner, Keszegh, Lemons, Palmer, Pálvölgyi and Patkós conjectured that, if |X| is sufficiently large with respect to k, then the minimum size of a saturated k-Sperner system F ⊆ P(X) is 2k−1. In this ...